A pursuit-evasion differential game with slow pursuers on the edge graph of simplexes. I
نویسندگان
چکیده
منابع مشابه
Pursuit-Evasion Differential Game with Many Inertial Players
We consider pursuit-evasion differential game of countable number inertial players in Hilbert space with integral constraints on the control functions of players. Duration of the game is fixed. The payoff functional is the greatest lower bound of distances between the pursuers and evader when the game is terminated. The pursuers try to minimize the functional, and the evader tries to maximize i...
متن کاملFixed Duration Pursuit-Evasion Differential Game with Integral Constraints
We investigate a pursuit-evasion differential game of countably many pursuers and one evader. Integral constraints are imposed on control functions of the players. Duration of the game is fixed and the payoff of the game is infimum of the distances between the evader and pursuers when the game is completed. Purpose of the pursuers is to minimize the payoff and that of the evader is to maximize ...
متن کاملSimple Motion Evasion Differential Game of Many Pursuers and One Evader with Integral Constraints on Control Functions of Players
We consider an evasion differential game of many pursuers and one evader with integral constraints in the plane. The game is described by simple equations. Each component of the control functions of players is subjected to integral constraint. Evasion is said to be possible if the state of the evader does not coincide with that of any pursuer. Strategy of the evader is constructed based on cont...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملLinear Differential Game With Two Pursuers and One Evader
The purpose of this paper is to compute two on one differential game No Escape Zones (NEZ) [8]. The main objective (over the scope of this paper) consists in designing suboptimal strategies in many on many engagements. 1x1 NEZ and 2x1 NEZ are components involved in suboptimal approaches we propose (i.e. “Moving Horizon Hierarchical Decomposition Algorithm” [6]). Several specific two pursuers on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Game Theory and Applications
سال: 2020
ISSN: 2074-9872
DOI: 10.17076/mgta_2020_4_23